Learning Translations via Matrix Completion
نویسندگان
چکیده
Bilingual Lexicon Induction is the task of learning word translations without bilingual parallel corpora. We model this task as a matrix completion problem, and present an effective and extendable framework for completing the matrix. This method harnesses diverse bilingual and monolingual signals, each of which may be incomplete or noisy. Our model achieves state-of-the-art performance for both high and low resource languages.
منابع مشابه
Supplemental Materials for “ Spectral Compressed Sensing via Structured Matrix Completion ”
This supplemental document presents details concerning analytical derivations that support the theorems made in the main text " Spectral Compressed Sensing via Structured Matrix Completion " , accepted to the 30th International Conference on Machine Learning (ICML 2013). One can find here the detailed proof of Theorems 1-3.
متن کاملClimate Prediction via Matrix Completion
Recently, machine learning has been applied to the problem of predicting future climates, informed by the multi-model ensemble of physics-based climate models that inform the Intergovernmental Panel on Climate Change (IPCC). Past work (Monteleoni et al., 2011, McQuade and Monteleoni, 2012) demonstrated the promise of online learning algorithms applied to this problem. Here we propose a novel ap...
متن کاملMatrix completion and low-rank SVD via fast alternating least squares
The matrix-completion problem has attracted a lot of attention, largely as a result of the celebrated Netflix competition. Two popular approaches for solving the problem are nuclear-norm-regularized matrix approximation (Candès and Tao, 2009; Mazumder et al., 2010), and maximum-margin matrix factorization (Srebro et al., 2005). These two procedures are in some cases solving equivalent problems,...
متن کاملSpectral Learning of General Weighted Automata via Constrained Matrix Completion
Many tasks in text and speech processing and computational biology require estimating functions mapping strings to real numbers. A broad class of such functions can be defined by weighted automata. Spectral methods based on the singular value decomposition of a Hankel matrix have been recently proposed for learning a probability distribution represented by a weighted automaton from a training s...
متن کاملRank-One Matrix Completion with Automatic Rank Estimation via L1-Norm Regularization
Completing a matrix from a small subset of its entries, i.e., matrix completion, is a challenging problem arising from many real-world applications, such as machine learning and computer vision. One popular approach to solving the matrix completion problem is based on low-rank decomposition/factorization. Low-rank matrix decomposition-based methods often require a pre-specified rank, which is d...
متن کامل